Surface Patches from Unorganized Space Curves
نویسندگان
چکیده
منابع مشابه
Constructing N-sided Toric Surface Patches from Boundary Curves ⋆
Constructing N -sided surface patches to fill holes plays an important role in Computer Aided Geometric Design. In this paper, we present a method to construct a single toric surface patch interpolating N -sided boundary curves. The control points of the patch are determined by the given boundary curves and energy optimization. The main advantage of the method is that the toric surface patch ca...
متن کاملSurface Reconstruction from Unorganized Points
1. Briefly summarize the paper’s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results? [AS] This paper presents an algorithm that produces a simplicial surface, approximating a manifold surface M, from an unorganized set of points containing little to no information about M. It presents a new approach to the problem of recovering surf...
متن کاملSurface Reconstruction from Unorganized 3D Point Clouds
Computer-based surfacemodels are indispensable in several fields of science and engineering. For example, the design and manufacturing of vehicles, such as cars and aircrafts, would not be possible without sophisticated CAD and simulation tools predicting the behavior of the product. On the other hand, designers often do not like working on virtual models, though sophisticated tools, like immer...
متن کاملVariational Volumetric Surface Reconstruction from Unorganized Points
Reconstruction of smooth surfaces from point sets is an important problem in many applications since this sort of data often appear in real-life scenarios. This paper presents method for solving this this problem at interactive rates by means of second order energy minimization obtained by solving △2 = 0 on a discrete scalar field using an iterative multigrid approach. Every step in the reconst...
متن کامل3D Surface Reconstruction from Unorganized Sparse Cross Sections
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2011
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2011.02012.x